Product-free sets with high density

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Product-free Sets with High Density

We show that there are sets of integers with asymptotic density arbitrarily close to 1 in which there is no solution to the equation ab = c, with a, b, c in the set. We also consider some natural generalizations, as well as a specific numerical example of a product-free set of integers with asymptotic density greater than 1/2.

متن کامل

THE MAXIMAL DENSITY OF PRODUCT-FREE SETS IN Z/nZ

This paper studies the maximal size of product-free sets in Z/nZ. These are sets of residues for which there is no solution to ab ≡ c (mod n) with a, b, c in the set. In a previous paper we constructed an infinite sequence of integers (ni)i≥1 and product-free sets Si in Z/niZ such that the density |Si|/ni → 1 as i → ∞, where |Si| denotes the cardinality of Si. Here we obtain matching, up to con...

متن کامل

High density piecewise Syndeticity of Product Sets in Amenable Groups

M. Beiglböck, V. Bergelson, and A. Fish proved that if G is a countable amenable group and A and B are subsets of G with positive Banach density, then the product set AB is piecewise syndetic. This means that there is a finite subset E of G such that EAB is thick, that is, EAB contains translates of any finite subset of G. When G = Z, this was first proven by R. Jin. We prove a quantitative ver...

متن کامل

Alliance free sets in Cartesian product graphs

Let G = (V,E) be a graph. For a non-empty subset of vertices S ⊆ V , and vertex v ∈ V , let δS(v) = |{u ∈ S : uv ∈ E}| denote the cardinality of the set of neighbors of v in S, and let S = V − S. Consider the following condition: δS(v) ≥ δS(v) + k, (1) which states that a vertex v has at least k more neighbors in S than it has in S. A set S ⊆ V that satisfies Condition (1) for every vertex v ∈ ...

متن کامل

Groups whose locally maximal product - free sets are complete

Let G be a finite group and S a subset of G. Then S is product-free if S ∩ SS = ∅, and complete if G∗ ⊆ S ∪ SS. A product-free set is locally maximal if it is not contained in a strictly larger product-free set. If S is product-free and complete then S is locally maximal, but the converse does not necessarily hold. Street and Whitehead [11] defined a group G as filled if every locally maximal p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 2012

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa155-2-4